Partitioning the projective plane and the dunce hat
نویسندگان
چکیده
We show that any finite triangulation of the real projective plane or dunce hat is partitionable. To prove this, we introduce simple yet useful gluing tools allow us to reduce partitionability a given complex smaller constituent relative subcomplexes such as disk open M\"obius strip. The process generates partitioning schemes with distinctive shelling/constructible flavor. also give tool lift simplicial complexes preimages certain quotient maps.
منابع مشابه
Linear Spaces and Partitioning the Projective Plane
The aim of this paper is to settle a question about the partitioning of the projective plane by lines except for a small set. Suppose that Q is a set of points in the projective plane of order n and 6 is a set of lines that partitions the complement of Q. If Q has at most 2n&1 points and P has less than n+1+n lines, then these lines are concurrent. An example is given which shows that the condi...
متن کاملthe relationship between learners critical thinking ability and their performance in the reading sections of the tofel and ielts test
the study reflected in this thesis aims at finding out relationships between critical thinking (ct), and the reading sections of tofel and ielts tests. the study tries to find any relationships between the ct ability of students and their performance on reading tests of tofel and academic ielts. however, no research has ever been conducted to investigate the relationship between ct and the read...
15 صفحه اولPercolation on the Projective Plane
Since the projective plane is closed, the natural homological observable of a percolation process is the presence of the essential cycle in H1(RP 2; Z2). In the Voroni model at critical phase, pc = .5, this observable has probability q = .5 independent of the metric on RP 2. This establishes a single instance (RP 2, homological observable) of a very general conjecture about the conformal invari...
متن کاملTriangulating the Real Projective Plane
We consider the problem of computing a triangulation of the real projective plane P , given a finite point set P = {p1, p2, . . . , pn} as input. We prove that a triangulation of P always exists if at least six points in P are in general position, i.e., no three of them are collinear. We also design an algorithm for triangulating P if this necessary condition holds. As far as we know, this is t...
متن کاملConics on the Projective Plane
In this paper, we discuss a special property of conics on the projective plane and answer questions in enumerative algebraic geometry such as ”How many points determine a conic?” and ”How many conics do we expect to pass through m points and tangent to n lines?”
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2022
ISSN: ['1095-9971', '0195-6698']
DOI: https://doi.org/10.1016/j.ejc.2022.103584